A New Mappingheuristic Based Onmean Field Annealing 1
نویسنده
چکیده
A new mapping heuristic is developed, based on the recently proposed Mean Field Annealing (MFA) algorithm. An eecient implementation scheme, which decreases the complexity of the proposed algorithm by asymptotical factors, is also given. Performance of the proposed MFA algorithm is evaluated in comparison with two well-known heuristics; Simulated Annealing and Kernighan-Lin. Results of the experiments indicate that MFA can be used as an alternative heuristic for solving the mapping problem. Inherent parallelism of MFA is exploited by designing an eecient parallel algorithm for the proposed MFA heuristic.
منابع مشابه
Estimation of Software Reliability by Sequential Testing with Simulated Annealing of Mean Field Approximation
Various problems of combinatorial optimization and permutation can be solved with neural network optimization. The problem of estimating the software reliability can be solved with the optimization of failed components to its minimum value. Various solutions of the problem of estimating the software reliability have been given. These solutions are exact and heuristic, but all the exact approach...
متن کاملA New Hybrid Routing Algorithm based on Genetic Algorithm and Simulated Annealing for Vehicular Ad hoc Networks
In recent years, Vehicular Ad-hoc Networks (VANET) as an emerging technology have tried to reduce road damage and car accidents through intelligent traffic controlling. In these networks, the rapid movement of vehicles, topology dynamics, and the limitations of network resources engender critical challenges in the routing process. Therefore, providing a stable and reliable routing algorithm is ...
متن کاملA New Mapping Heuristic Based on Mean Field Annealing
A new mapping heuristic is developed based on the recently proposed Mean Field Annealing MFA algorithm An e cient implementation scheme which decreases the complexity of the proposed algorithm by asymptotical factors is also given Per formance of the proposed MFA algorithm is evaluated in comparison with two well known heuristics Simulated Annealing and Kernighan Lin Results of the exper iments...
متن کاملSequencing Mixed Model Assembly Line Problem to Minimize Line Stoppages Cost by a Modified Simulated Annealing Algorithm Based on Cloud Theory
This research presents a new application of the cloud theory-based simulated annealing algorithm to solve mixed model assembly line sequencing problems where line stoppage cost is expected to be optimized. This objective is highly significant in mixed model assembly line sequencing problems based on just-in-time production system. Moreover, this type of problem is NP-hard and solving this probl...
متن کاملConvolutive independent component analysis by leave-one-out optimal kernel approximation
This work addresses on blind separation of convolutive mixtures of independent sources. The temporally convolutive structure is assumed to be composed of multiple mixing matrices, each corresponding to a time delay, collectively transforming a segment of consecutive source signals to form multichannel observations. As τ = 1, this problem reduces to linear independent component analysis. For arb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992